Using Transaction Data for the Design of Sequential, Multi-unit, Online Auctions
نویسندگان
چکیده
1 We acknowledge the helpful comments on earlier versions of this work from seminar participants at Abstract Internet auctions for consumers' goods are an increasingly popular selling venue. The Internet's computational ability makes possible the sale of multiple units of the same good in a single auction. Many sellers, instead of offering the entire inventory at a single auction, split it into sequential auctions of smaller lots, to reduce the negative market impact of large lots. We investigate how the available inventory should be split into multiple lots and how many sequential auctions should be run. We also investigate how we can leverage information technology to improve the design of future auctions. Assuming a truth-revealing ascending auction model, we quantify the effect of auction lot size on the closing price. We then develop a model for allocating inventory across multiple auctions. Solving the dynamic programming formulation, we prove that the lot size drops from period to period. The intensity of the decline increases in the holding costs and the website's traffic intensity, while decreasing in the dispersion of consumers' valuations of the good. Finally, we extend this model to dynamically incorporate the results of previous auctions as feedback into the design of consecutive auctions, updating the lot size and number of auctions. We demonstrate how information signals from previous auctions should be used to update the auctioneer's belief s about the customers' valuation distribution, thereby significantly increasing the sellers' profit potential. We use several examples to show how the benefits of using detailed transaction data for the design of sequential, multi-unit, online auctions is influenced by the inventory holding costs, bid traffic, and the dispersion of consumers' valuations.
منابع مشابه
Using bid data for the management of sequential, multi-unit, online auctions with uniformly distributed bidder valuations
Internet auctions for consumers’ goods are an increasingly popular selling venue. We have observed that many sellers, instead of offering their entire inventory in a single auction, split it into sequential auctions of smaller lots, thereby reducing the negative market impact of larger lots. Information technology also makes it possible to collect and analyze detailed bid data from online aucti...
متن کاملBidding Behavior Evolution in Sequential Auctions: Characterization and Analysis
Retailers are increasingly exploiting sequential online auctions as an effective and low cost distribution channel for disposing large quantities of inventory. In such auction environments, bidders have the opportunity of participating in many auctions to learn and choose the bidding strategy that best fits their preferences. Previous studies have mostly focused on identifying bidding strategie...
متن کاملMulti-Unit Auctions
We survey experimental research on multi-unit auctions with an emphasis on topics that may be of a unifying interest to experimental, as well as theoretical and empirical economists. Topics include static and dynamic multi-unit auctions; combinatorial auctions and efficient auction design; simultaneous and sequential auctions; bidder asymmetry and endogenous entry, and collusion in auctions. We...
متن کاملFormation of Willingness to pay by Repeat Bidders in Sequential Online Auctions
In this study, we investigate the formation of bidder’s willingness to pay (WTP) in sequential online auctions. Our findings contribute to the literature of online auctions in the following ways. First, we detect and empirically measure in a real world scenario the WTP updating phenomenon mentioned by Engelbrecht-Wiggans (2000). By considering the environment of multiple sequential auctions of ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001